Depth Reduction for Circuits of Unbounded Fan-In
نویسندگان
چکیده
We prove that constant depth circuits of size n log O(1) n over the basis AND, OR, PARITY are no more powerful than circuits of this size with depth four. Similar techniques are used to obtain several other depth reduction theorems; in particular, we show every set in AC 0 can be recognized by a family of depththree threshold circuits of size n log O(1) n . The size bound n log O(1) n is optimal when considering depth reduction over AND, OR, and PARITY. Most of our results hold both for the uniform and the nonuniform case.
منابع مشابه
Quantum Circuits with Unbounded Fan-out
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf ) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[q], and counting. Classically, we need logarithmic depth even if we can use unboun...
متن کاملA New Circuit Scheme for Wide Dynamic Circuits
In this paper, a new circuit scheme is proposed to reduce the power consumption of dynamic circuits. In the proposed circuit, an NMOS keeper transistor is used to maintain the voltage level in the output node against charge sharing, leakage current and noise sources. Using the proposed keeper scheme, the voltage swing on the dynamic node is lowered to reduce the power consumption of wide fan-in...
متن کاملDepth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
The depth hierarchy results for monotone circuits of Raz and McKenzie [5] are extended to the case of monotone circuits of semiunbounded fan-in. It follows that the inclusions NC ⊆ SAC ⊆ AC are proper in the monotone setting, for every i ≥ 1. Mathematics Subject Classification. 68Q17, 68Q15.
متن کاملPower of Uninitialized Qubits in Shallow Quantum Circuits
We study the computational power of shallow quantum circuits with n input qubits, one output qubit, and two types of ancillary qubits: O(log n) initialized and O(poly(n)) uninitialized qubits. The initial state of the uninitialized ancillary qubits is arbitrary, and we have to return their state into the initial one at the end of the computation. First, to show the strengths of such circuits, w...
متن کاملA new approach to the design of optimal parallel prefix circuits
Parallel prefix is one of the fundamental algorithms in computer science. Parallel prefix networks are used to compute carries in fast addition circuits, and have a number of other applications, including the computation of linear recurrences and loop parallelization. A new construction, called Slices, for fan-out-constrained depth size optimal (DSO) parallel prefix circuits is presented. The c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 112 شماره
صفحات -
تاریخ انتشار 1994